Packet classifiers in ternary CAMs can be smaller
نویسندگان
چکیده
منابع مشابه
Design of multi-field IPv6 packet classifiers using ternary CAMs
Typically, high-end routers/switches classify a packet by looking for multiple fields of the IP/TCP headers and recognize which flow the packet belongs to. Several packet classification algorithms to accelerate packet processing and reduce the memory requirement have been proposed. But it is not easy to implement these algorithms in hardware to lookup these multiple fields in the same time. Thi...
متن کاملFast incremental updates on Ternary-CAMs for routing lookups and packet classification
One popular hardware device for performing fast routing lookups and packet classification is a ternary content-addressable memory (TCAM). A TCAM searches the header of the incoming packet against all entries in the forwarding table or the classifier database in parallel. It keeps the entries in decreasing order of priority of the rules in a classifier, or prefix lengths of the entries in a forw...
متن کاملA Tcam Can Sort in O ( N ) Memory Cycles . Sorting and Searching Using Ternary Cams
As the computing world evolves, the need for faster, feature-rich, and cost-effective solutions increases. To obtain higher performance, designers are building more features in hardware using application-specific integrated circuit and field-programmable gate array technology. Many applications encounter sorting and range search problems. For example, in layer 4 switching, you might search for ...
متن کاملA Comparative Study of Low-Power Techniques for Ternary CAMs
Ternary content addressable memories (TCAMs) are attractive for applications such as packet forwarding and classification in network routers. However, the high cost and power consumption are limiting their popularity and versatility. In this paper, we present a comparative study of the design techniques for low-power TCAMs.
متن کاملLearning classifiers with ternary weights Learning linear classifiers with ternary weights from Metagenomic Data
Motivated by recent researches in metagenomic classification tasks, this paper investigates the problem of finding interpretable concepts from training data in which the number of features is larger than the number of samples. In this setting, the classification problem is modeled as a combinatorial optimization problem, in which the aim of the learner is to find a {−1, 0, +1}-weighted linear t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review
سال: 2006
ISSN: 0163-5999
DOI: 10.1145/1140103.1140313